Efficient Marker Matching Using Pair-Wise Constraints in Physical Therapy

نویسندگان

  • Gregory Johnson
  • Nianhua Xie
  • Jill Slaboda
  • Y. Justin Shi
  • Emily Keshner
  • Haibin Ling
چکیده

In this paper, we report a robust, efficient, and automatic method for matching infrared tracked markers for human motion analysis in computer-aided physical therapy applications. The challenges of this task stem from non-rigid marker motion, occlusion, and timing requirements. To overcome these difficulties, we use pair-wise distance constraints for marker identification. To meet the timing requirements, we first reduce the candidate marker labels by proximity constraints before enforcing the pair-wise constraints. Experiments with 38 real motion sequences, our method has shown superior accuracy and significant speedup over a semi-automatic proprietary method and the Iterative Closest Point (ICP) approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing image steganography by combining the GA and ICA

In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...

متن کامل

A Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain

This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...

متن کامل

Factorized Graph Matching

Graph matching plays a central role to solve correspondence problems in computer vision. Graph matching problems that incorporate pair-wise constraints can be casted as a quadratic assignment problem (QAP). Unfortunately, QAP is NP-hard and many algorithms have been proposed to solve different relaxations. This paper presents factorized graph matching (FGM), a novel framework for interpreting a...

متن کامل

Fast and Robust 2D Parametric Image Registration

Camera stabilization is an important task for video analysis. In this report, we describe a method for estimating and stabilizing camera motion between two images via 2D image registration. Our approach is based on a pair-wise registration of images parameterized by 2D affine or projective transformation. Pair-wise image registration estimates transformation parameters for each pair of consecut...

متن کامل

Fuzzy Linear Programming Method for Deriving Priorities in the Fuzzy Analytic Hierarchy Process

There are various methods for obtaining the preference vector of pair-wise comparison matrix factors. These methods can be employed when the elements of pair-wise comparison matrix are crisp while they are inefficient for fuzzy elements of pair-wise comparison matrix. In this paper, a method is proposed by which the preference vector of pair-wise comparison matrix elements can be obtained even ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010